Incomplete generalized Tribonacci polynomials and numbers
نویسندگان
چکیده
The main object of this paper is to present a systematic investigation of a new class of polynomials – incomplete generalized Tribonacci polynomials and a class of numbers associated with the familiar Tribonacci polynomials. The various results obtained here for these classes of polynomials and numbers include explicit representations, generating functions, recurrence relations and summation formulas.
منابع مشابه
A Generalization of the $k$-Bonacci Sequence from Riordan Arrays
In this article, we introduce a family of weighted lattice paths, whose step set is {H = (1, 0), V = (0, 1), D1 = (1, 1), . . . , Dm−1 = (1,m − 1)}. Using these lattice paths, we define a family of Riordan arrays whose sum on the rising diagonal is the k-bonacci sequence. This construction generalizes the Pascal and Delannoy Riordan arrays, whose sum on the rising diagonal is the Fibonacci and ...
متن کاملViewing Some Ordinary Differential Equations from the Angle of Derivative Polynomials
In the paper, the authors view some ordinary differential equations and their solutions from the angle of (the generalized) derivative polynomials and simplify some known identities for the Bernoulli numbers and polynomials, the Frobenius-Euler polynomials, the Euler numbers and polynomials, in terms of the Stirling numbers of the first and second kinds.
متن کاملDeterminantal Representations for Generalized Fibonacci and Tribonacci Numbers
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Using certain Hessenberg matrices, we provide some determinantal representations of the general terms of second-and third-order linear recurrence sequences with arbitrary initial values. Moreover, we provide explicit formu...
متن کاملA Complete Categorization of When Generalized Tribonacci Sequences Can Be Avoided by Additive Partitions
A set or sequence U in the natural numbers is defined to be avoidable if N can be partitioned into two sets A and B such that no element of U is the sum of two distinct elements of A or of two distinct elements of B. In 1980, Hoggatt [5] studied the Tribonacci sequence T = {tn} where t1 = 1, t2 = 1, t3 = 2, and tn = tn−1 + tn−2 + tn−3 for n ≥ 4, and showed that it was avoidable. Dumitriu [3] co...
متن کاملMore Identities On The Tribonacci Numbers
In this paper, we use a simple method to derive di¤erent recurrence relations on the Tribonacci numbers and their sums. By using the companion matrices and generating matrices, we get more identities on the Tribonacci numbers and their sums, which are more general than that given in literature [E. Kilic, Tribonacci Sequences with Certain Indices and Their Sum, Ars Combinatoria 86 (2008), 13-22....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016